摘要 :
With the blossoming of online shopping, a lot of goods need be distributed to customers. For a logistics company, how to improve the delivery efficiency, reduce the logistics cost and satisfy the real logistical constraints includ...
展开
With the blossoming of online shopping, a lot of goods need be distributed to customers. For a logistics company, how to improve the delivery efficiency, reduce the logistics cost and satisfy the real logistical constraints including vehicle's capacity and customer's available time window is an important issue. This kind of problem is called Vehicle Routing Problem with Time Windows (VRPTW). Although a number of algorithms based on artificial intelligence have been proposed, most of them cannot efficiently solve VRPTW while the number of goods increases rapidly. In this paper, we propose a novel approach named Pool-based Recursive Constructor (PRC) to efficiently find a set of logistics routes by considering real logistics constraints. In PRC, an urgent value measurement, several customer selection strategies and a pool-based mechanism are proposed to evaluate the cost of each customer and select the most suitable customer for route constructing, recursively. Through the experimental evaluation based on two semi-real logistics datasets and comparison with two greedy strategies used by Kerry TJ Logistics, PRC shows an excellent performance in terms of route quality.
收起
摘要 :
With the blossoming of online shopping, a lot of goods need be distributed to customers. For a logistics company, how to improve the delivery efficiency, reduce the logistics cost and satisfy the real logistical constraints includ...
展开
With the blossoming of online shopping, a lot of goods need be distributed to customers. For a logistics company, how to improve the delivery efficiency, reduce the logistics cost and satisfy the real logistical constraints including vehicle's capacity and customer's available time window is an important issue. This kind of problem is called Vehicle Routing Problem with Time Windows (VRPTW). Although a number of algorithms based on artificial intelligence have been proposed, most of them cannot efficiently solve VRPTW while the number of goods increases rapidly. In this paper, we propose a novel approach named Pool-based Recursive Constructor (PRC) to efficiently find a set of logistics routes by considering real logistics constraints. In PRC, an urgent value measurement, several customer selection strategies and a pool-based mechanism are proposed to evaluate the cost of each customer and select the most suitable customer for route constructing, recursively. Through the experimental evaluation based on two semi-real logistics datasets and comparison with two greedy strategies used by Kerry TJ Logistics, PRC shows an excellent performance in terms of route quality.
收起
摘要 :
Security attacks using USB interfaces and devices are becoming more advanced, which boost efforts to develop counter measures in order to protect systems and data. One of the most recent attacks using USB devices is the BadUSB att...
展开
Security attacks using USB interfaces and devices are becoming more advanced, which boost efforts to develop counter measures in order to protect systems and data. One of the most recent attacks using USB devices is the BadUSB attack, performed by spoofing the device's firmware and allowing the attackers to execute a set of malicious actions, e.g. an USB storage device could be mounted as USB keyboard in order to inject malicious scripts into the system. This paper proposes a protection agent against BadUSB attack developed for Windows operative systems. It allows a user to check the class of an USB device ready to be mounted, though enabling the detection of a potential attack if the expected functionality of the device does not match with its class type. The results show that the proposed protection agent is capable of detecting potential intrusions by blocking the installation of the device, scanning the device for something that identifies it, searching for a description locally and finally warning the user about the device meaning that all devices must be approved by the user when plugged in if the system protection agent is running.
收起
摘要 :
Computer security has always been an issue in gigantic as well as small-sized businesses. A major realm of security breach in such firms is a poor privileged access, adjustment or occasionally fakes of critical business, or user i...
展开
Computer security has always been an issue in gigantic as well as small-sized businesses. A major realm of security breach in such firms is a poor privileged access, adjustment or occasionally fakes of critical business, or user information. In this paper, we present the Current Existing Lock methods that serve as a transitional barrier in opposition to unethical deeds. We explain how these solutions work and how they are configured. However, these methods still lack essential properties and advanced anticipation techniques to prevent information loss or damage at the end of the day.
收起
摘要 :
Computer security has always been an issue in gigantic as well as small-sized businesses. A major realm of security breach in such firms is a poor privileged access, adjustment or occasionally fakes of critical business, or user i...
展开
Computer security has always been an issue in gigantic as well as small-sized businesses. A major realm of security breach in such firms is a poor privileged access, adjustment or occasionally fakes of critical business, or user information. In this paper, we present the Current Existing Lock methods that serve as a transitional barrier in opposition to unethical deeds. We explain how these solutions work and how they are configured. However, these methods still lack essential properties and advanced anticipation techniques to prevent information loss or damage at the end of the day.
收起
摘要 :
To achieve the privacy-enhancing authentications without any TTP (Trusted Third Party), blacklistable anonymous credential systems have been proposed. In conventional blacklistable anonymous credential systems, a user is blacklist...
展开
To achieve the privacy-enhancing authentications without any TTP (Trusted Third Party), blacklistable anonymous credential systems have been proposed. In conventional blacklistable anonymous credential systems, a user is blacklisted after the user misbehaves once. Since it is too harsh to be of practical use, extended blacklistable anonymous credential systems based on reputation have been proposed. In the reputation-based system, each behavior of a user is given a score. The service provider publishes a reputation list of correspondences between session ID and the score. In the authentication, a user can anonymously prove the total of his own scores. However, the previously proposed systems have the efficiency problem: The authentication data size is O(|L|) or O(K), where |L| is the size of the reputation list L, and K is the size of the following window. In the window type of systems, the authentication is based on a window with most recent K authentications of the user. When a past authentication becomes outside the window, the misbehaving of the authentication is forgiven. Thus, K should be as large as possible. Therefore, the previous systems suffer from O(|L|) or O(K)-size data in each authentication. In addition, in the previous systems, the authentication needs the computation of O(|L|) or O(K) exponentiations, which is heavy. In this paper, an efficient blacklistable anonymous credential system with reputation is proposed. In our system, the data size of the authentication does not depend on parameters such as |L| and K, and is O(1). Furthermore, although the computational costs in the authentication depend on some parameters, the parameter-related costs are only multiplications instead of exponentiations. For constructing our system, we newly introduce the concept of an accumulator for reputation, and show an efficient pairing-based construction. Using the accumulator, we construct the efficient blacklistable anonymous credential system with reputation.
收起
摘要 :
To achieve the privacy-enhancing authentications without any TTP (Trusted Third Party), blacklistable anonymous credential systems have been proposed. In conventional blacklistable anonymous credential systems, a user is blacklist...
展开
To achieve the privacy-enhancing authentications without any TTP (Trusted Third Party), blacklistable anonymous credential systems have been proposed. In conventional blacklistable anonymous credential systems, a user is blacklisted after the user misbehaves once. Since it is too harsh to be of practical use, extended blacklistable anonymous credential systems based on reputation have been proposed. In the reputation-based system, each behavior of a user is given a score. The service provider publishes a reputation list of correspondences between session ID and the score. In the authentication, a user can anonymously prove the total of his own scores. However, the previously proposed systems have the efficiency problem: The authentication data size is O(|L|) or O(K), where |L| is the size of the reputation list L, and K is the size of the following window. In the window type of systems, the authentication is based on a window with most recent K authentications of the user. When a past authentication becomes outside the window, the misbehaving of the authentication is forgiven. Thus, K should be as large as possible. Therefore, the previous systems suffer from O(|L|) or O(K)-size data in each authentication. In addition, in the previous systems, the authentication needs the computation of O(|L|) or O(K) exponentiations, which is heavy. In this paper, an efficient blacklistable anonymous credential system with reputation is proposed. In our system, the data size of the authentication does not depend on parameters such as |L| and K, and is O(1). Furthermore, although the computational costs in the authentication depend on some parameters, the parameter-related costs are only multiplications instead of exponentiations. For constructing our system, we newly introduce the concept of an accumulator for reputation, and show an efficient pairing-based construction. Using the accumulator, we construct the efficient blacklistable anonymous credential system with reputation.
收起
摘要 :
This paper presents a co-simulation of the different parameters which affect the illuminance inside a working environment. A key factor in this analysis is the daylight illuminance that penetrates into the building skin and the va...
展开
This paper presents a co-simulation of the different parameters which affect the illuminance inside a working environment. A key factor in this analysis is the daylight illuminance that penetrates into the building skin and the variations that it presents for different days of the year and sky types. A second parameter that is examined is the lighting behavior of the users. Each user presents unique preferences which affect the use of manual blinds and artificial lights. The proper assessment of his/her preferences are in great importance and they should be taken into account by a future smart lighting system, considering that a personalized illumination level is the key to a better working environment. Based on measurements concerning internal illuminance in regard to work place occupancy and outdoor weather conditions, user preferences probability functions are presented. It is shown that subjective criteria, related to personal preferences, differentiate behavior patterns even for users with similar objective characteristics. These patterns, along with the simulated daylight penetration and the effect of manual blinds, can lead to the proper estimation of the energy demand for a user oriented lighting installation.
收起
摘要 :
This paper presents a co-simulation of the different parameters which affect the illuminance inside a working environment. A key factor in this analysis is the daylight illuminance that penetrates into the building skin and the va...
展开
This paper presents a co-simulation of the different parameters which affect the illuminance inside a working environment. A key factor in this analysis is the daylight illuminance that penetrates into the building skin and the variations that it presents for different days of the year and sky types. A second parameter that is examined is the lighting behavior of the users. Each user presents unique preferences which affect the use of manual blinds and artificial lights. The proper assessment of his/her preferences are in great importance and they should be taken into account by a future smart lighting system, considering that a personalized illumination level is the key to a better working environment. Based on measurements concerning internal illuminance in regard to work place occupancy and outdoor weather conditions, user preferences probability functions are presented. It is shown that subjective criteria, related to personal preferences, differentiate behavior patterns even for users with similar objective characteristics. These patterns, along with the simulated daylight penetration and the effect of manual blinds, can lead to the proper estimation of the energy demand for a user oriented lighting installation.
收起
摘要 :
Nowadays daylight apertures in buildings are designed on the bases of overcast sky conditions in wintertime in Slovakia and Czech Republic. The criterion is the relative value of the Daylight Factor in its average 0.9% in two refe...
展开
Nowadays daylight apertures in buildings are designed on the bases of overcast sky conditions in wintertime in Slovakia and Czech Republic. The criterion is the relative value of the Daylight Factor in its average 0.9% in two reference points in the middle depth of the room. Commonly, in practice as a consequence are designed windows roughly 1.5 - 1.7 m high in living rooms. The proposed European standard FprEN17037 is introducing a new criterion median exterior horizontal illuminance with the required indoor illuminance 300 lx in the middle of the room depth or 100 lx as minimum close to the rear wall. This study discusses problems of the design of window size in residential buildings and consequences of the new median criterion as well as the required interior illuminance in absolute lux values.
收起
原文获取